Multiple-Conclusion System as Communication Calculus
نویسندگان
چکیده
منابع مشابه
A Multiple-Conclusion Calculus for First-Order Gödel Logic
We present a multiple-conclusion hypersequent system for the standard first-order Gödel logic. We provide a constructive, direct, and simple proof of the completeness of the cut-free part of this system, thereby proving both completeness for its standard semantics, and the admissibility of the cut rule in the full system. The results also apply to derivations from assumptions (or “non-logical a...
متن کاملA System for Proper Multiple-conclusion Entailment
The concept of proper multiple-conclusion entailment is introduced. For any sets X, Y of formulas, we say that Y is properly mc-entailed by X iff Y is mc-entailed by X, but no A ∈ Y is single-conclusion entailed by X. The concept has a natural interpretation in terms of question evocation. A sound and complete axiom system for the propositional case of proper mc-entailment is presented.
متن کاملA Multiple-Conclusion Meta-Logic
The theory of cut-free sequent proofs has been used to motivate and justify the design of a number of logic programming languages. Two such languages, λProlog and its linear logic refinement, Lolli [12], provide for various forms of abstraction (modules, abstract data types, higher-order programming) but lack primitives for concurrency. The logic programming language, LO (Linear Objects) [2] pr...
متن کاملNetwork Calculus viewed as a Min-plus System Theory applied to Communication Networks
We analyze some queueing problems arising in guaranteed service and controlled load networks using min-plus algebra. We nd an explicit representation for the sub-additive closure of the minimum of two operators, and we introduce a new, useful family of idempotent, time-varying, and min-plus linear operators. We model queueing systems arising in networks networks as non-linear min-plus systems t...
متن کاملForum: a Multiple-conclusion Speciication Logic
The theory of cut-free sequent proofs has been used to motivate and justify the design of a number of logic programming languages. Two such languages, Prolog and its linear logic reenement, Lolli 15], provide for various forms of abstraction (modules, abstract data types, and higher-order programming) but lack primitives for concurrency. The logic programming language, LO (Linear Objects) 2] pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2000
ISSN: 1571-0661
DOI: 10.1016/s1571-0661(05)80331-7